#include "binTree.h"
#include <iostream>
#include <vector>
using namespace std;
int main()
{
    char alphabeta[] = "xABCDEFGHIJ";
    BinTree myTree;
    vector<Node *> pre(myTree.preOrderTraverse());
    vector<Node *> in(myTree.inOrderTraverse());
    vector<Node *> post(myTree.postOrderTraverse());
    vector<Node *> level(myTree.levelTraverse());
    cout<<"Pre-order Travverse:\t";
    for (int i=0 ; i < pre.size(); i++)
        cout<<alphabeta[pre[i]->getValue()]<<"\t";
    cout<<endl;
    cout<<"In-order Travverse:\t";
    for (int i=0 ; i < in.size(); i++)
        cout<<alphabeta[in[i]->getValue()]<<"\t";
    cout<<endl;
    cout<<"Post-order Travverse:\t";
    for (int i=0 ; i < post.size(); i++)
        cout<<alphabeta[post[i]->getValue()]<<"\t";
    cout<<endl;
    cout<<"Level Travverse:\t";
    for (int i=0 ; i < level.size(); i++)
        cout<<alphabeta[level[i]->getValue()]<<"\t";
    cout<<endl;
    return 0;
}
    

